首页> 外文OA文献 >A modal logic amalgam of classical and intuitionistic propositional logic
【2h】

A modal logic amalgam of classical and intuitionistic propositional logic

机译:经典和直觉命题的模态逻辑混合   逻辑

摘要

A famous result, conjectured by G\"odel in 1932 and proved by McKinsey andTarski in 1948, says that $\varphi$ is a theorem of intuitionisticpropositional logic IPC iff its G\"odel-translation $\varphi'$ is a theorem ofmodal logic S4. In this paper, we extend an intuitionistic version of modallogic S1+SP, introduced in our previous paper (S. Lewitzka, Algebraic semanticsfor a modal logic close to S1, J. Logic and Comp., doi:10.1093/logcom/exu067)to a classical modal logic L and prove the following: a propositional formula$\varphi$ is a theorem of IPC iff $\square\varphi$ is a theorem of L (actually,we show: $\Phi\vdash_{IPC}\varphi$ iff $\square\Phi\vdash_L\square\varphi$, forpropositional $\Phi,\varphi$). Thus, the map $\varphi\mapsto\square\varphi$ isan embedding of IPC into L, i.e. L contains a copy of IPC. Moreover, L is aconservative extension of classical propositional logic CPC. In this sense, Lis an amalgam of CPC and IPC. We show that L is sound and complete w.r.t. aclass of special Heyting algebras with a (non-normal) modal operator.
机译:著名的结果是1932年由G \“ odel猜想的,并在1948年由McKinsey和Tarski证明的。逻辑S4。在本文中,我们扩展了模态逻辑S1 + SP的直观版本,该模型在我们之前的论文(S. Lewitzka,代数语义为接近S1的模态逻辑,J。Logic and Comp。,doi:10.1093 / logcom / exu067)中进行了介绍。经典模态逻辑L并证明以下内容:命题公式$ \ varphi $是IPC的定理iff $ \ square \ varphi $是L的一个定理(实际上,我们显示:$ \ Phi \ vdash_ {IPC} \ varphi $ iff $ \ square \ Phi \ vdash_L \ square \ varphi $,命题$ \ Phi,\ varphi $)。因此,映射$ \ varphi \ mapsto \ square \ varphi $是IPC到L的嵌入,即L包含IPC的副本。此外,L是经典命题逻辑CPC的保守扩展。从这个意义上说,Lis是CPC和IPC的合并。我们证明L是完好无损的具有(非正态)模态运算符的特殊Heyting代数的一类。

著录项

  • 作者

    Lewitzka, Steffen;

  • 作者单位
  • 年度 2015
  • 总页数
  • 原文格式 PDF
  • 正文语种 {"code":"en","name":"English","id":9}
  • 中图分类

相似文献

  • 外文文献
  • 中文文献
  • 专利

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号